A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs
نویسندگان
چکیده
منابع مشابه
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs
Given a graph G, a proper n − [p]-coloring is a mapping f : V (G) → 2{1,...,n} such that |f(v)| = p for any vertex v ∈ V (G) and f(v) ∩ f(u) = ∅ for any pair of adjacent vertices u and v. n − [p]-coloring is closely related to multicoloring. Finding multicoloring of induced subgraphs of the triangular lattice (called hexagonal graphs) has important applications in cellular networks. In this art...
متن کاملA Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs
Let G be a series-parallel graph. In this paper, we present a linear algorithm of constructing an oriented binary decomposition tree of G. We use it to find 33 unavoidable subgraphs of G. Based on these 33 avoidable subgraphs, we can determine the edge-face chromatic number, denoted by χef (G), of G where G is 2-connected and Δ(G) = 5. This completes the literature of determining χef (G) for 2-...
متن کاملColoring Meyniel graphs in linear time
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel graph and finds a clique of maximum size.
متن کاملA cutting plane algorithm for graph coloring
We present an approach based on integer programming formulations of the graph coloring problem. Our goal is to develop models that remove some symmetrical solutions obtained by color permutations. We study the problem from a polyhedral point of view and determine some families of facets of the 0/1-polytope associated with one of these integer programming formulations. The theoretical results de...
متن کاملA Linear Time Algorithm for Solving the Incidence Coloring Problem on Strongly Chordal Graphs
An incidence of G consists of a vertex and one of its incident edge in G. The incidence coloring problem is a variation of vertex coloring problem. The problem is to find the minimum number (called incidence coloring number) of colors assigned to every incidence of G so that the adjacent incidences are not assigned the same color. In this paper, we propose a linear time algorithm for incidence-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2005
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-004-1134-x